منابع مشابه
An Unbiased Estimator of the Variance of Simple Random Sampling Using Mixed Random-Systematic Sampling
Systematic sampling is a commonly used technique due to its simplicity and ease of implementation. The drawback of this simplicity is that it is not possible to estimate the design variance without bias. There are several ways to circumvent this problem. One method is to suppose that the variable of interest has a random order in the population, so the sample variance of simple random sampling ...
متن کاملRandom sampling: Billiard Walk algorithm
Hit-and-Run is known to be one of the best random sampling algorithms, its mixing time is polynomial in dimension. Nevertheless, in practice the number of steps required to achieve uniformly distributed samples is rather high. We propose new random walk algorithm based on billiard trajectories. Numerical experiments demonstrate much faster convergence to uniform distribution.
متن کاملAn Unbiased Adaptive Sampling Algorithm for the Exploration of RNA Mutational Landscapes under Evolutionary Pressure
The analysis of the relationship between sequences and structures (i.e., how mutations affect structures and reciprocally how structures influence mutations) is essential to decipher the principles driving molecular evolution, to infer the origins of genetic diseases, and to develop bioengineering applications such as the design of artificial molecules. Because their structures can be predicted...
متن کاملAN ADAPTIVE IMPORTANCE SAMPLING-BASED ALGORITHM USING THE FIRST-ORDER METHOD FOR STRUCTURAL RELIABILITY
Monte Carlo simulation (MCS) is a useful tool for computation of probability of failure in reliability analysis. However, the large number of samples, often required for acceptable accuracy, makes it time-consuming. Importance sampling is a method on the basis of MCS which has been proposed to reduce the computational time of MCS. In this paper, a new adaptive importance sampling-based algorith...
متن کاملUnbiased sampling of network ensembles
Sampling random graphs with given properties is a key step in the analysis of networks, as random ensembles represent basic null models required to identify patterns such as communities and motifs. A key requirement is that the sampling process is unbiased and efficient. The main approaches are microcanonical, i.e. they sample graphs that exactly match the enforced constraints. Unfortunately, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1982
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/25.1.45